Algorithmique rapide pour les problèmes de tournées et d'ordonnancement. (Time-salving algorithms for vehicule routing and scheduling problems)
نویسنده
چکیده
In this thesis, we deal with modeling and solving various problems including vehicle routing and scheduling. We propose approximate methods that aim to solve problems quickly and e ciently. Five problems are addressed. The rst one is the Resource-Constrained Project Scheduling Problem (RCPSP) for which a multi-commodity ow approach is introduced. We also consider methods dealing with extensions of this problem ( nancial or time constraints). The second one is a two dimensional Orthogonal Packing Problem (2OPP) with the resolution being based on its RCPSP relaxation. The third one is the Stacker Crane Problem (SCP). It is a pickup and delivery problem: goods must be transported from starting points to various destinations with a eet of vehicles. In the SCP, a single one-capacity vehicle is available. We propose original tree based models and algorithms for the preemptive case. The fourth one is a Dial-a-Ride Problem (DARP) with nancial constraints. We solve this problem through an insertion heuristic using a constraint propagation technique. The fth one combines routing problem and two dimensional packing. It is the 2L-CVRP in which items have to be delivered to customers. A GRASP×ELS framework is introduced for this problem. Experimental results show the e ectiveness of the proposed methods.
منابع مشابه
New Selection Schemes in a Memetic Algorithm for the Vehicle Routing Problem with Time Windows
This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a leastcost set of trips to serve customers during specific time windows. The proposed solution method is a memetic algorithm (MA), a genetic algorithm hybridised with a local search. Contrary to most papers on the VRPTW, which minimize first the number of vehicles, our method is ...
متن کاملSéro-agglutination rapide et macroscopique pour la recherche d'anticorps de la Fièvre Q. chez les animaux
متن کامل
Multicriteria scheduling problems: a survey
This paper presents a state-of-the-art survey on multicriteria scheduling and introduces a definition of a multicriteria scheduling problem. It provides a framework that allows to tackle multicriteria scheduling problems, according to Decision Aid concepts. This problem is decomposed into three different problems. The first problem is about obtaining a model. The second one is how to take crite...
متن کاملIntégration de l'Apprentissage non Supervisé aux Métaheuristiques pour la Résolution des Problèmes d'Optimisation Combinatoire Difficiles
Résumé. Le présent article rentre dans le cadre d’un projet ambitieux qui a pour objectif l’intégration des techniques d’apprentissage aux métaheuristiques pour contribuer à la résolution des problèmes d’optimisation combinatoire NP-difficiles. L’approche proposée consiste à incorporer un apprentissage non supervisé aux métaheuristiques à population de solutions pour « apprendre » et constituer...
متن کاملWorst-Case Analysis of Scheduling Heuristics of Parallel Systems
It is well-known that most scheduling problems arising from parallel systems are NP-hard, even under very special assumptions. Thus various suboptimal algorithms, in particular heuristics, were proposed in the literature. Worst-case error bounds are established in this note for heuristics of makespan minimization of parallel computations. Diierent parallel computation models are investigated, i...
متن کامل